Sorting Lab¶

image-4.png

Q1. Implement Heapsort algorithm using Minheap.¶

This must include building the heap as well as using it to sort an input array.¶
  • The heapsort need not be done in-place.

Q2. Implement Binary Search Tree with the following operations:¶

  • insert
  • remove
  • find minimum ##### You may implement other methods to support the ones mentioned above.